منابع مشابه
The diameter and Laplacian eigenvalues of directed graphs
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly connected directed graphs G, namely D(G) ≤ ⌊ 2maxx log(1/φ(x)) log 2 2−λ ⌋ + 1 where λ is the first non-trivial eigenvalue of the Laplacian and φ is the Perron vector of the transition probability matrix of a random walk ...
متن کاملOn Computing the Diameter of Real-World Directed (Weighted) Graphs
In this paper we propose a new algorithm for computing the diameter of directed unweighted graphs. Even though, in the worst case, this algorithm has complexity O(nm), where n is the number of nodes and m is the number of edges of the graph, we experimentally show that in practice our method works in O(m) time. Moreover, we show how to extend our algorithm to the case of directed weighted graph...
متن کاملThe Diameter and Laplacian Eigenvalues of Directed Graphs
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly connected directed graphs G, namely D(G) ≤ ⌊ 2minx log(1/φ(x)) log 2 2−λ ⌋ + 1 where λ is the first non-trivial eigenvalue of the Laplacian and φ is the Perron vector of the transition probability matrix of a random walk ...
متن کاملOn Diameter of Line Graphs
The diameter of a connected graph $G$, denoted by $diam(G)$, is the maximum distance between any pair of vertices of $G$. Let $L(G)$ be the line graph of $G$. We establish necessary and sufficient conditions under which for a given integer $k geq 2$, $diam(L(G)) leq k$.
متن کاملNumber Theoretic Designs for Directed Regular Graphs of Small Diameter
In 1989, F. R. K. Chung gave a construction for certain directed h-regular graphs of small diameter. Her construction is based on finite fields, and the upper bound on the diameter of these graphs is derived from bounds for certain very short character sums. Here we present two similar constructions that are based on properties of discrete logarithms and exponential functions in residue rings m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2005
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2004.11.005